Using Transfinite Ordinal Conditional Functions
نویسنده
چکیده
Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from the set of worlds to the set of ordinals. But in subsequent paper by Spohn and others, OCFs are just used as functions from the set of worlds to natural numbers (plus eventually +∞). The use of transfinite ordinals in this framework has never been studied. This paper opens this way. We study generalisations of transmutations operators to transfinite ordinals. Using transfinite ordinals allows to represent different “levels of beliefs”, that naturally appear in real applications. This can be viewed as a generalisation of the usual “two levels of beliefs” framework: knowledge versus beliefs; or rules base versus facts base, issued from expert systems works.
منابع مشابه
Sur les fonctions ordinales conditionnelles transfinies
Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from the set of worlds to the set of ordinals. But in subsequent paper by Spohn and others, OCFs are just used as functions from the set of worlds to natural numbers (plus eventually +∞). The use of transfinite ordinals in this frame...
متن کاملPredicative Functionals and an Interpretation of ID^_
In 1958 Gödel published his Dialectica interpretation, which reduces classical arithmetic to a quantifier-free theory T axiomatizing the primitive recursive functionals of finite type. Here we extend Gödel’s T to theories Pn of “predicative” functionals, which are defined using MartinLöf’s universes of transfinite types. We then extend Gödel’s interpretation to the theories of arithmetic induct...
متن کاملOn the Structure of the Wadge Degrees of Bqo-valued Borel Functions
In this article, we give a full description of the Wadge degrees of Borel functions from ω to a better quasi ordering Q. More precisely, for any countable ordinal ξ, we show that the Wadge degrees of ∆1+ξ-measurable functions ω ω → Q can be represented by countable joins of the ξ-th transfinite nests ofQ-labeled well-founded trees.
متن کاملTransfinite Iteration Functionals and Ordinal Arithmetic
Although transfinite iteration functionals have been used in the past to construct ever-larger initial segments of the ordinals ([5],[1]), there appears to be little investigation into the nature of the functionals themselves. In this note, we investigate the relationship between (countable) transfinite iteration and ordinal arithmetic. While there is a nice connection between finite iteration ...
متن کاملThe proof - theoretic analysis of Σ 11 transfinite dependent choice ∗
This article provides an ordinal analysis of Σ1 transfinite dependent choice.
متن کامل